Beyond Degree Distributions: Local to Global Structure of Social Contact Graphs
نویسندگان
چکیده
Endogenous Market-Clearing Prices and Reference Point Adaptation p. 2 Modeling Effect of Leaders in Ethno-Religious Conflicts p. 3 Calibrating Subjective Probabilities Using Hierarchical Bayesian Models p. 13 State-Dependent Risk Preferences in Evolutionary Games p. 23 Social Learning and Cumulative Innovations in a Networked Group p. 32 Understanding Segregation Processes (Abstract) p. 42 Social Factors in Creating an Integrated Capability for Health System Modeling and Simulation p. 44
منابع مشابه
Social Network Analysis: Local and Global Centrality as the Communication Network Structure in the Beef Cattle Farmer Groups
The dynamic among farmer institutions has essential problems to be addressed, especially regarding the pattern and process of communication interactions developing farmer institutions. Therefore, an assembly of agribusiness information within the communication network of the farmer group is of primary interest for our study. This study aims to analyze the agribusiness network structure of beef ...
متن کاملLocal Network Patterns in Protein-Protein Interfaces
Protein-protein interfaces hold the key to understanding protein-protein interactions. In this paper we investigated local interaction network patterns beyond pair-wise contact sites by considering interfaces as contact networks among residues. A contact site was defined as any residue on the surface of one protein which was in contact with a residue on the surface of another protein. We labele...
متن کاملRandom graphs with arbitrary degree distributions and their applications.
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in the past. In this paper we develop in detail the theory of random graphs with arbitrary degree distributions. In addition to simple undirected, unipartite graph...
متن کاملLocal Algorithms for Finding Interesting Individuals in Large Networks
We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties — such as high degree or clustering coefficient — in large social or other networks. We introduce a new model, called the Jump and Crawl model, in which algorithms are permitted only two graph operations. The Jump operation returns a randomly chosen vertex, and is meant to model th...
متن کاملEmergence of Scale-Free Close-Knit Friendship Structure in Online Social Networks
Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properti...
متن کامل